4,878 research outputs found
Parameter Sensitivity Analysis of Social Spider Algorithm
Social Spider Algorithm (SSA) is a recently proposed general-purpose
real-parameter metaheuristic designed to solve global numerical optimization
problems. This work systematically benchmarks SSA on a suite of 11 functions
with different control parameters. We conduct parameter sensitivity analysis of
SSA using advanced non-parametric statistical tests to generate statistically
significant conclusion on the best performing parameter settings. The
conclusion can be adopted in future work to reduce the effort in parameter
tuning. In addition, we perform a success rate test to reveal the impact of the
control parameters on the convergence speed of the algorithm
Base Station Switching Problem for Green Cellular Networks with Social Spider Algorithm
With the recent explosion in mobile data, the energy consumption and carbon
footprint of the mobile communications industry is rapidly increasing. It is
critical to develop more energy-efficient systems in order to reduce the
potential harmful effects to the environment. One potential strategy is to
switch off some of the under-utilized base stations during off-peak hours. In
this paper, we propose a binary Social Spider Algorithm to give guidelines for
selecting base stations to switch off. In our implementation, we use a penalty
function to formulate the problem and manage to bypass the large number of
constraints in the original optimization problem. We adopt several randomly
generated cellular networks for simulation and the results indicate that our
algorithm can generate superior performance
An Inter-molecular Adaptive Collision Scheme for Chemical Reaction Optimization
Optimization techniques are frequently applied in science and engineering
research and development. Evolutionary algorithms, as a kind of general-purpose
metaheuristic, have been shown to be very effective in solving a wide range of
optimization problems. A recently proposed chemical-reaction-inspired
metaheuristic, Chemical Reaction Optimization (CRO), has been applied to solve
many global optimization problems. However, the functionality of the
inter-molecular ineffective collision operator in the canonical CRO design
overlaps that of the on-wall ineffective collision operator, which can
potential impair the overall performance. In this paper we propose a new
inter-molecular ineffective collision operator for CRO for global optimization.
To fully utilize our newly proposed operator, we also design a scheme to adapt
the algorithm to optimization problems with different search space
characteristics. We analyze the performance of our proposed algorithm with a
number of widely used benchmark functions. The simulation results indicate that
the new algorithm has superior performance over the canonical CRO
- …